Application of mixed integer quadratic program to shortest vector problems
نویسندگان
چکیده
منابع مشابه
Concave Quadratic Cuts for Mixed-Integer Quadratic Problems
The technique of semidefinite programming (SDP) relaxation can be used to obtain a nontrivial bound on the optimal value of a nonconvex quadratically constrained quadratic program (QCQP). We explore concave quadratic inequalities that hold for any vector in the integer lattice Z, and show that adding these inequalities to a mixed-integer nonconvex QCQP can improve the SDP-based bound on the opt...
متن کاملAutomatic Optimal Biped Walking as a Mixed-Integer Quadratic Program
This paper proposes an original Model Predictive Control approach to the walking control for humanoid robots, which allows to generate stable walking motions without the prior definition of footsteps positions and instants. Both the instant and amplitude of the changes in the supporting surface are part of the walking motion generation problem, and are described by a set of highly-constrained i...
متن کاملA novel branch-and-bound algorithm for quadratic mixed-integer problems with quadratic constraints
The efficient numerical treatment of convex quadratic mixed-integer optimization poses a challenging problem for present branch-and-bound algorithms. We introduce a method based on the duality principle for nonlinear convex problems to derive suitable bounds that can be directly exploit to improve heuristic branching rules. Numerical results indicate that the bounds allow the branch-and-bound t...
متن کاملMixed-Integer Support Vector Machine
In this paper, we propose a formulation of a feature selecting support vector machine based on the L0-norm. We explore a perspective relaxation of the optimization problem and solve it using mixed-integer nonlinear programming (MINLP) techniques. Given a training set of labeled data instances, we construct a maxmargin classifier that minimizes the hinge loss as well as the cardinality of the we...
متن کاملContributions to General Mixed Integer Knapsack Problems
This paper deals with a general mixed integer knapsack polyhedron for which we introduce and analyze a new family of inequalities. We discuss the value of this family both from a theoretic and a computational point of view.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JSIAM Letters
سال: 2017
ISSN: 1883-0609,1883-0617
DOI: 10.14495/jsiaml.9.65